The beowulf strategy aims at minimizing computation time Beowulf策略的目的是最小化计算时间。
Moreover , the proposed method reduces the computation time greatly 并且,该方法能够大大减少运算所需的时间。
So a good msa program tries to get a best balance between alignment quality and computation time 所以,那些取得对齐质量与对齐时间最佳平衡的程序就是好的多序列对齐程序。
To reduce the computation time , which is often too long in conventional genetic algorithm , the idea of tabu search is employed 配电网络重构,本文采用了改进的遗传算法与禁忌搜索法相结合。
The optimization quality and computation time of set covering arid tabu search algorithms were analyzed and compared 摘要分析和比较了集合覆盖和禁忌搜索两种高效布局算法的优化性能和计算时间。